skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "JOHANSSON, TONY"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, Combinatorics, Probability and Computing)
    Assume that the edges of the complete graph K n are given independent uniform [0, 1] weights. We consider the expected minimum total weight μ k of k ⩽ 2 edge-disjoint spanning trees. When k is large we show that μ k ≈ k 2 . Most of the paper is concerned with the case k = 2. We show that m 2 tends to an explicitly defined constant and that μ 2 ≈ 4.1704288. . . . 
    more » « less
    Full Text Available